Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
|||
Showing 1 - 4 of 4 matches in All Departments
In "Distributed Algorithms," Nancy Lynch provides a blueprint
for designing, implementing, and analyzing distributed algorithms.
She directs her book at a wide audience, including students,
programmers, system designers, and researchers. "Distributed Algorithms" contains the most significant
algorithms and impossibility results in the area, all in a simple
automata-theoretic setting. The algorithms are proved correct, and
their complexity is analyzed according to precisely defined
complexity measures. The problems covered include resource
allocation, communication, consensus among distributed processes,
data consistency, deadlock detection, leader election, global
snapshots, and many others. The material is organized according to the system model first by
the timing model and then by the interprocess communication
mechanism. The material on system models is isolated in separate
chapters for easy reference. The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures."
DISC, the International Symposium on DIStributed Computing, is an inter- tional forum on the theory, design, analysis, implementation and application of distributed systems and networks. DISC is organized in cooperation with the European Association for Theoretical Computer Science (EATCS). This volume contains the papers presented at DISC 2010, the 24th Inter- tional Symposium on Distributed Computing, held on September 13-15,2010 in Cambridge, Massachusetts. The volume also includes the citation for the 2010 Edsger W. Dijkstra Prize in Distributed Computing, jointly sponsored by DISC and PODC (the ACM Symposium on Principles of Distributed Computing), which was presented at PODC 2010 in Zurich to Tushar D. Chandra, Vassos Hadzilacos, and Sam Toueg for their work on failure detectors. Therewere135paperssubmittedtothesymposium(inadditiontherewere14 abstract-only submissions). The Program Committee selected 32 contributions out of the 135 full-paper submissions for regular presentations at the sym- sium. Each presentation is accompanied by a ?fteen-page paper in this volume. Everysubmitted paper was read and evaluated by at least three members of the ProgramCommittee. The committee was assisted by more than 120 external - viewers. The Program Committee made its ?nal decisions during the electronic meeting held on June 18-29, 2010. Revised and expanded versions of several selected papers will be consideredfor publication in a special issue of the journal Distributed Computing. TheprogramalsoincludedthreeinvitedlecturesbyRachidGuerraoui(EPFL, Switzerland), Barbara Liskov (MIT, USA), and Nitin Vaidya (University of Il- nois, USA).
This book develops a theory for transactions that provides practical solutions for system developers, focusing on the interface between the user and the database that executes transactions. Atomic transactions are a useful abstraction for programming concurrent and distributed data processing systems. Presents many important algorithms which provide maximum concurrency for transaction processing without sacrificing data integrity. The authors include a well-developed data processing case study to help readers understand transaction processing algorithms more clearly. The book offers conceptual tools for the design of new algorithms, and for devising variations on the familiar algorithms presented in the discussions. Whether your background is in the development of practical systems or formal methods, this book will offer you a new way to view distributed systems.
This book develops a theory for transactions that provides practical solutions for system developers, focusing on the interface between the user and the database that executes transactions. Atomic transactions are a useful abstraction for programming concurrent and distributed data processing systems. Presents many important algorithms which provide maximum concurrency for transaction processing without sacrificing data integrity. The authors include a well-developed data processing case study to help readers understand transaction processing algorithms more clearly. The book offers conceptual tools for the design of new algorithms, and for devising variations on the familiar algorithms presented in the discussions. Whether your background is in the development of practical systems or formal methods, this book will offer you a new way to view distributed systems.
|
You may like...
|